Two Topics in Hyperelliptic Cryptography
نویسندگان
چکیده
In this paper we address two important topics in hyperelliptic cryptography. The first is how to construct in a verifiably random manner hyperelliptic curves for use in cryptography in generas two and three. The second topic is how to perform divisor compression in the hyperelliptic case. Hence in both cases we generalize concepts used in the more familiar elliptic curve case to the hyperelliptic context.
منابع مشابه
Algebraic curves and cryptography
Algebraic curves over finite fields are being extensively used in the design of public-key cryptographic schemes. This paper surveys some topics in algebraic curve cryptography, with an emphasis on recent developments in algorithms for the elliptic and hyperelliptic curve discrete logarithm problems, and computational problems in pairing-based cryptography.
متن کاملHyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کاملPoint Compression on Jacobians of Hyperelliptic Curves over Fq
— Hyperelliptic curve cryptography recently received a lot of attention, especially for constrained environments. Since there space is critical, compression techniques are interesting. In this note we propose a new method which avoids factoring the first representing polynomial. In the case of genus two the cost for decompression is, essentially, computing two square roots in Fq, the cost for c...
متن کاملBit Security of the Hyperelliptic Curves Diffie-Hellman Problem
The Diffie-Hellman problem as a cryptographic primitive plays an important role in modern cryptology. The Bit Security or Hard-Core Bits of Diffie-Hellman problem in arbitrary finite cyclic group is a long-standing open problem in cryptography. Until now, only few groups have been studied. Hyperelliptic curve cryptography is an alternative to elliptic curve cryptography. Due to the recent crypt...
متن کاملGenus Two Hyperelliptic Curve Coprocessor
Hyperelliptic curve cryptography with genus larger than one has not been seriously considered for cryptographic purposes because many existing implementations are significantly slower than elliptic curve versions with the same level of security. In this paper, the first ever complete hardware implementation of a hyperelliptic curve coprocessor is described. This coprocessor is designed for genu...
متن کامل